منابع مشابه
The ODE method for stability of skip-free Markov chains with applications to MCMC
Fluid limit techniques have become a central tool to analyze queueing networks over the last decade, with applications to performance analysis, simulation and optimization. In this paper, some of these techniques are extended to a general class of skip-free Markov chains. As in the case of queueing models, a fluid approximation is obtained by scaling time, space and the initial condition by a l...
متن کاملLevel Crossing Ordering of Skip-free-to-the-right Continuous-time Markov Chains
As proposed by Irle and Gani in 2001, a process X is said to be slower in level crossing than a process Y if it takesX stochastically longer to exceed any given level than it does Y . In this paper, we extend a result of Irle (2003), relative to the level crossing ordering of uniformizable skip-free-to-the-right continuous-time Markov chains, to derive a new set of sufficient conditions for the...
متن کاملSimplified policy iteration for skip-free Markov decision processes
We describe and analyse a new simplified policy iteration type algorithm for finite average cost Markov decision processes that are skip-free in the negative direction. We show that the algorithm is guaranteed to converge after a finite number of iterations, but the computational effort required for each iteration step is comparable with that for value iteration. We show that the analysis can b...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملBrief Announcement: Sorting on Skip Chains
Sorting values on a chain of processes is a well-known problem, and a number of algorithms has been published [1,2]. We consider here a generalization of this problem, where the processes that have values, called major processes, are separated from each other by any number of intermediate processes, called relay processes, which do not have their own values, although they can read and write the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2019
ISSN: 0002-9947,1088-6850
DOI: 10.1090/tran/7773